A Genetic Algorithm Approach for NonIgnorable Missing Data
نویسندگان
چکیده
منابع مشابه
A Semiparametric Approach for Analyzing Nonignorable Missing Data
In missing data analysis, there is often a need to assess the sensitivity of key inferences to departures from untestable assumptions regarding the missing data process. Such sensitivity analysis often requires specifying a missing data model that commonly assumes parametric functional forms for the predictors of missingness. In this paper, we relax the parametric assumption and investigate the...
متن کاملA Genetic Algorithm Approach for Non-Ignorable Missing Data
The databases store data that may be subjected to missing values either in data acquisition or data storage process. The proposed approach uses the widely used optimization technique called genetic algorithm for the NMAR (Not Missing At Random) missing mechanism which prevails more in real life that are non-ignorable. Since the non-ignorable mechanism needs prior
متن کاملA Genetic Algorithm Approach for Non-Ignorable Missing Data
The databases store data that may be subjected to missing values either in data acquisition or data storage process. The proposed approach uses the widely used optimization technique called genetic algorithm for the NMAR (Not Missing At Random) missing mechanism which prevails more in real life that are nonignorable. Since the non-ignorable mechanism needs prior basic knowledge about the data t...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2419-3237